\Sigma\Pi-polycategories, additive linear logic, and process semantics
نویسنده
چکیده
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multichannel concurrent processes. The polycategorical model induced by this process semantics is shown to be equivalent to the free polycategory based on the syntax (i.e., it is full and faithfully complete). This establishes that the additive fragment of linear logic provides a semantics of concurrent processes. Another property of this semantics is that it gives a canonical representation of proofs in additive linear logic. This arXived version omits Section 1.7.1: “Circuit diagrams for polycategories” as the XY-pic diagrams would not compile due to lack of memory. For a complete version see .
منابع مشابه
Concurrent Games and Full Completeness
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It also admits an elegant and robust formalization. A Full Completeness Theorem for Multiplicative-Additive Linear Logic is proved for this semantics.
متن کاملLogic Programming with Bunched Implications (extended Abstract)
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...
متن کاملRelational semantics for a fragment of linear logic
Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [4] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [5] a type of frames is described which generalize Kripke frames and provide semantics for ...
متن کاملShapely monads and analytic functors
In mathematics and computer science, we often encounter structures which are faithfully encoded by a graphical calculus of the following sort. The basic data of the structure are depicted as certain diagrams; the basic operations of the structure act by glueing together these diagrams along certain parts of their boundaries; and the axioms of the structure are just those necessary to ensure tha...
متن کاملOn Bunched Predicate Logic
We present the logic of bunched implications, BI, in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between conjunction and implication, and may be viewed as a merging of intuitionistic logic and multiplicative, intuitionistic linear logic. The predi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره math.CT/0312422 شماره
صفحات -
تاریخ انتشار 2003